A Note on Fairness in I/O Automata
نویسندگان
چکیده
Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch & Tuttle. The concept of a fair I/O automaton is introduced and it is shown that a fair I/O automaton paired with the set of its fair executions is a live I/O automaton provided that (1) in each reachable state at most countably many fairness sets are enabled, and (2) input actions cannot disable strong fairness sets. This result, which generalizes previous results known from the literature, was needed to solve a problem posed by Broy & Lamport for the Dagstuhl Workshop on Reactive Systems.
منابع مشابه
Quiescence, Fairness, Testing, and the Notion of Implementation
Two formalisms for concurrency, the Input Output automaton model and the theory of testing, are compared and are shown to have common foundations. The relationship between the fair and quiescent preorders of I O automata is investigated and the two preorders are shown to coincide subject to some restrictions. I O automata are encoded into the theory of testing and the reversed must preorder is ...
متن کاملQuiescence , Fairness , Testing , and Implementation ( Extended abstract ) the Notion of
Abs t rac t . Two different formalisms for concurrency are compared and are shown to have common foundations. The Input/Output automaton model and the theory of testing are analyzed in the framework of transition systems. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide on a large class of automata. I/O automat...
متن کاملQuiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract)
Two diierent formalisms for concurrency are compared and are shown to have common foundations. The Input/Output automaton model and the theory of testing are analyzed in the framework of transition systems. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide on a large class of automata. I/O automata are encoded i...
متن کاملInput/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,
The term Input/Output Automata refers to a family of system modeling frameworks based on interacting infinite-state machines. The models come in several flavors, based on which features (fairness, time, continuous behavior, probability, etc.) they can express. In each of these frameworks, automata can be composed in parallel to form more complex automata, and automata can be related using level...
متن کاملOn-the-fly Emptiness Check of Transition-Based Streett Automata
In the automata theoretic approach to model checking, checking a state-space S against a linear-time property φ can be done in O(|S| × 2) time. When model checking under n strong fairness hypotheses expressed as a Generalized Büchi automaton, this complexity becomes O(|S| × 2). Here we describe an algorithm to check the emptiness of Streett automata, which allows model checking under n strong f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 59 شماره
صفحات -
تاریخ انتشار 1996